The structure of dual Grassmann codes
نویسندگان
چکیده
In this article we study the duals of Grassmann codes, certain codes coming from the Grassmannian variety. Exploiting their structure, we are able to count and classify all their minimum weight codewords. In this classification the lines lying on the Grassmannian variety play a central role. Related codes, namely the affine Grassmann codes, were introduced more recently in [1], while their duals were introduced and studied in [2]. In this paper we also classify and count the minimum weight codewords of the dual affine Grassmann codes. Combining the above classification results, we are able to show that the dual of a Grassmann code is generated by its minimum weight codewords. We use these properties to establish that the increase of value of successive generalized Hamming weights of a dual Grassmann code is 1 or 2. AMS classification 14G50, 94B27, 14M15
منابع مشابه
Hyperplanes of Hermitian dual polar spaces of rank 3 containing a quad
Let F and F′ be two fields such that F′ is a quadratic Galois extension of F. If |F| ≥ 3, then we provide sufficient conditions for a hyperplane of the Hermitian dual polar space DH(5,F′) to arise from the Grassmann embedding. We use this to give an alternative proof for the fact that all hyperplanes of DH(5, q2), q 6= 2, arise from the Grassmann embedding, and to show that every hyperplane of ...
متن کاملHigher Weights of Affine Grassmann Codes and Their Duals
We consider the question of determining the higher weights or the generalized Hamming weights of affine Grassmann codes and their duals. Several initial as well as terminal higher weights of affine Grassmann codes of an arbitrary level are determined explicitly. In the case of duals of these codes, we give a formula for many initial as well as terminal higher weights. As a special case, we obta...
متن کاملSchubert unions in Grassmann varieties
We study subsets of Grassmann varieties G(l, m) over a field F , such that these subsets are unions of Schubert cycles, with respect to a fixed flag. We study the linear spans of, and in case of positive characteristic, the number of Fq-rational points on such unions. Moreover we study a geometric duality of such unions, and give a combinatorial interpretation of this duality. We discuss the ma...
متن کاملMinimum distance of Symplectic Grassmann codes
In this paper we introduce Symplectic Grassmann codes, in analogy to ordinary Grassmann codes and Orthogonal Grassmann codes, as projective codes defined by symplectic Grassmannians. Lagrangian–Grassmannian codes are a special class of Symplectic Grassmann codes. We describe all the parameters of line Symplectic Grassmann codes and we provide the full weight enumerator for the Lagrangian–Grassm...
متن کاملHigher Weights of Grassmann Codes
Using a combinatorial approach to studying the hyperplane sections of Grassmannians, we give two new proofs of a result of Nogin concerning the higher weights of Grassmann codes. As a consequence, we obtain a bound on the number of higher dimensional subcodes of the Grassmann code having the minimum Hamming norm. We also discuss a generalization of Grassmann codes .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 79 شماره
صفحات -
تاریخ انتشار 2016